Computing minimal interpolation bases
نویسندگان
چکیده
منابع مشابه
Computing minimal interpolation bases
We consider the problem of computing univariate polynomial matrices over a field that represent minimal solution bases for a general interpolation problem, some forms of which are the vector M-Padé approximation problem in [Van Barel and Bultheel, Numerical Algorithms 3, 1992] and the rational interpolation problem in [Beckermann and Labahn, SIAM J. Matrix Anal. Appl. 22, 2000]. Particular inst...
متن کاملNotes on computing minimal approximant bases
When s = 1 and N = ‖n‖ − 1 this is the classical Hermite Padé approximation problem. Here we allow N to be arbitrary. We describe algorithms for computing an order N genset of type n: a matrix V ∈ k[x]∗×m such that every row of V is a solution to (1) and every solution P of (1) can be expressed as a k[x]-linear combination of the rows of V . Ideally, V will be a minbasis of solutions: V has ful...
متن کاملMinimal generators from reduced Gröbner bases obtained by interpolation methods
In 1982 Buchberger and Möller described a polynomial algorithm to compute a reduced Gröbner basis of the ideal of affine points basing on interpolation methods. This algorithm was an incisive step for a worthwhile progress in computation of zero-dimensional schemes and their applications. The consequent generalization of the original algorithm of Buchberger and Möller to projective points gave ...
متن کاملPolynomial Interpolation of Minimal Degree and Grr Obner Bases
This paper investigates polynomial interpolation with respect to a nite set of appropriate linear functionals and the close relations to the Grr obner basis of the associated nite dimensional ideal.
متن کاملCompiling Information-Flow Security to Minimal Trusted Computing Bases
Information-flow policies can express strong security requirements for programs run by distributed parties with different levels of trust. However, this security is hard to preserve as programs get compiled to distributed systems with (potentially) compromised machines. For instance, many programs involve computations too sensitive to be trusted to any of those machines. Also, many programs are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2017
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2016.11.015